Shape preserving polyhedral simplification with bounded error
نویسندگان
چکیده
منابع مشابه
Topology preserving data simplification with error bounds
Many approaches to simpliication of triangulated terrains and surfaces have been proposed which permit bounds on the error introduced. A few algorithms additionally bound errors in auxiliary functions deened over the triangulation. We present an approach to simpliication of scalar elds over unstructured grids which preserves the topology of functions deened over the triangulation, in addition t...
متن کاملShape-preserving Mesh Simplification based on Curvature Measures from the Polyhedral Gauss Map
This paper presents an improvement on methods for simplification of triangular meshes, based on discrete curvature measures. The basic tool is the Polyhedral Gauss Map (PGM), which is computed directly from a mesh and provides a detailed description of curvature associated with each individual vertex. Taking into consideration this description, we determine the Total Absolute Curvature, abbrevi...
متن کاملOne-Pass Error Bounded Trajectory Simplification
Nowadays, various sensors are collecting, storing and transmitting tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network band and computing resource. Line simplification (LS) algorithms are an effective approach to attacking this issue by compressing data points in a trajectory to a set of continuous line segments, and are commonly used in pr...
متن کاملScene Simpli®cation TOPOLOGY PRESERVING DATA SIMPLIFICATION WITH ERROR BOUNDS
ÐMany approaches to simpli®cation of triangulated terrains and surfaces have been proposed which permit bounds on the error introduced. A few algorithms additionally bound errors in auxiliary functions de®ned over the triangulation. We present an approach to simpli®cation of scalar ®elds over unstructured grids which preserves the topology of functions de®ned over the triangulation, in addition...
متن کاملSimplification of Arbitrary Polyhedral Meshes
Surface models containing billions of polygons are becoming more frequent in computer graphics. Mesh simplification is necessary for displaying such surfaces at interactive rates. We describe a novel method for simplifying polyhedral meshes while producing multiple levels of detail for progressive transmission and interactive exploration. Unlike previous work on mesh simplification, our method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 1998
ISSN: 0097-8493
DOI: 10.1016/s0097-8493(98)00063-6